List-Decoding for the Arbitrarily Varying Channel Under State Constraints
نویسندگان
چکیده
منابع مشابه
Correlated Decoding for Channels with Arbitrarily Varying Channel Probability Functions
Let X = I1, " '" , a}, Y = {1, ' " , b} be finite sets. A stochastic matrix w with a rows and b columns will be called a channel. X, Y are the input and output alphabets (respectively) of the channel. We denote the set of all channels with input alphabet X and output alphabet Y by e (X, Y). A channel w E C (X, Y) can be used for communication from one person, the sender, to another person, the ...
متن کاملDeterministic list codes for state-constrained arbitrarily varying channels
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission....
متن کاملThe capacity of the arbitrarily varying channel revisited: Positivity, constraints
A well-known result of Ahlswede asserts that the determinis-tic code capacity of an arbitrarily varying channel (AVC), under the average error probability criterion, either equals its random code capacity or else is zero. A necessary and sufficient condition is identified for deciding between these alternatives, namely, the capacity is zero if and only if the AVC is symmetrizable. The capacity ...
متن کاملState constraints and list decoding for the AVC
List decoding for arbitrarily varying channels (AVCs) under state constraints is investigated. It is shown that rates within ǫ of the randomized coding capacity of AVCs with input-dependent state can be achieved under maximal error with list decoding using lists of size O(1/ǫ). Under average error an achievable rate region and converse bound are given for lists of size L. These bounds are based...
متن کاملThe Arbitrarily Varying Relay Channel
We study the arbitrarily varying relay channel, and establish the cutset bound and partial decode-forward bound on the random code capacity. We further determine the random code capacity for special cases. Then, we consider conditions under which the deterministic code capacity is determined as well. In addition, we consider the arbitrarily varying Gaussian relay channel with sender frequency d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2012
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2011.2178153